Potentially Visible Set (PVS)
نویسنده
چکیده
Many graphics applications today have to cope with large amounts of data. A popular approach to reduce the amount of geometry to be rendered is to precompute visibility in order to render only objects that can be seen from the given viewpoint. This paper presents one technique to achieve this, potentially visible sets (PVS). These sets are used to avoid rendering hidden objects, especially geometry that is obscured by geometry closer to the viewer. Over the years many different techniques have been developed to perform this task. The idealized exact solution for general 3D scenes has often been regarded as computationally intractable. But recently a practical solution has been found. The essense of a new approach is to represent 3D polygons and the stabbing lines connecting them in a 5D Euclidean space derived from Plucker space and then to perform geometric subtractions of occluded lines from the set of potential stabbing lines.
منابع مشابه
Evaluating, Testing, and Animating PVS Specifications
We explore ways to enhance the utility of PVS for evaluating, testing, and animating PVS specifications. The PVS ground evaluator is the focus of the work. We describe a mechanism to provide semantic attachments for PVS symbols while preserving soundness, and discuss strategies to provide a generic framework for integrating independently developed applications with PVS. We explore these capabil...
متن کاملFrontier Sets in Large Terrain Environments with Applications to Decentralized Online Games
In current online games, player positions are synchronized by means of continual broadcasts through the server. This solution is expensive, forcing any server to limit its number of clients. With a hybrid networking architecture, player synchronization can be distributed to the clients, bypassing the server bottleneck and decreasing latency as a result. Synchronization in a decentralized fashio...
متن کاملBatch Proving and Proof Scripting in PVS
The batch execution modes of PVS are powerful, but highly technical, features of the system that are mostly accessible to expert users. This paper presents a PVS tool, called ProofLite, that extends the theorem prover interface with a batch proving utility and a proof scripting notation. ProofLite enables a semi-literate proving style where specification and proof scripts reside in the same fil...
متن کاملPVS # : Streamlined Tacticals for PVS 1
The semantics of a proof language relies on the representation of the state of a proof after a logical rule has been applied. This information, which is usually meaningless from a logical point of view, is fundamental to describe the control mechanism of the proof search provided by the language. In this paper, we present a monadic datatype to represent the state information of a proof and we i...
متن کامل